Weakening of Intuitionistic Negation for Many-valued Paraconsistent da Costa System
نویسندگان
چکیده
منابع مشابه
Weakening of Intuitionistic Negation for Many-valued Paraconsistent da Costa System
In this paper we propose substructural propositional logic obtained by da Costa weakening of the intuitionistic negation. We show that the positive fragment of the da Costa system is distributive lattice logic, and we apply a kind of da Costa weakening of negation, by preserving, differently from da Costa, its fundamental properties: antitonicity, inversion and additivity for distributive latti...
متن کاملOn Paraconsistent Weakening of Intuitionistic Negation
In [1], systems of weakening of intuitionistic negation logic called Zn and CZn were developed in the spirit of da Costa’s approach(c.f. [2]) by preserving, differently from da Costa, its fundamental properties: antitonicity, inversion and additivity for distributive lattices. However, according to [3], those systems turned out to be not paraconsistent but extensions of intuitionistic logic. Ta...
متن کاملParaconsistent Logic and Weakening of Intuitionistic Negation
A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. In an earlier paper [Notre Dame J. Form. Log. 49 (2008), 401–424], we developed the systems of weakening of intuitionistic negation logic, called Zn and CZn, in the spirit of da Costa’s approach by preserving, differently from da Costa, the fundamental properties of negation: antitonici...
متن کاملParaconsistent Knowledge Bases and Many-Valued Logic
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge bases. We present a paraconsistent many-valued logic with a simple and n...
متن کاملMany-Valued, Free, and Intuitionistic Logics
Standard logic is a package with two parts – a formal deductive apparatus and a conception of interpretation for the language. The deductive apparatus and the semantics are mutually reinforcing and in this chapter we examine primarily the semantic assumptions that formally justify the deductive machinery. The second part of the package, the semantics of ‘standard’ logic, includes the assumption...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2008
ISSN: 0029-4527
DOI: 10.1215/00294527-2008-020